Invariants of Bonded Knotoids and Applications to Protein Folding
نویسندگان
چکیده
In this paper, we study knotoids with extra graphical structure (bonded knotoids) in the settings of rigid vertex and topological graphs. We construct bonded knotoid invariants by applying tangle insertion unplugging at bonding sites a knotoid. demonstrate that our can be used for analysis proteins.
منابع مشابه
Protein Stability, Folding, Disaggregation and Etiology of Conformational Malfunctions
Estimation of protein stability is important for many reasons: first providing an understanding of the basic thermodynamics of the process of folding, protein engineering, and protein stability plays important role in biotechnology especially in food and protein drug design. Today, proteins are used in many branches, including industrial processes, pharmaceutical industry, and medical fields. A...
متن کاملLearning algorithms with applications to robot navigation and protein folding
We consider three problems in machine learning: concept learning in the PAC model mobile robot environment learning learning-based approaches to protein structure prediction In the PAC framework, we give an e cient algorithm for learning any function on k terms by general DNF. On the other hand, we show that in a well-studied restriction of the PAC model where the learner is not allowed to use ...
متن کاملDynamic Invariants in Protein Folding Pathways Revealed by Tensor Analysis
Recent advances in molecular dynamics simulation technologies (e.g., Folding@Home, NAMD, Desmond/Anton) have, for the first time, enabled scientists to perform all-atom simulations over timescales relevant to protein folding. Unfortunately, the concomitant increase in the size of the resulting data sets presents a barrier to understanding the molecular basis of folding. In particular, long simu...
متن کاملCombinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the string forms a self-avoiding walk on the lattice and the number of adjacent pairs of 1’s is maximized. The previously best-known approximation algorithm for this problem has a guarantee of 3 8 = .375 [HI95]. In this paper,...
متن کاملMultibody minimum-energy trajectory with applications to protein folding
This work addresses the optimal control of multibody systems being actuated with control forces in order to find a dynamically feasible minimum-energy trajectory of the system. The optimal control problem and its constraints are integrated in a discrete version of the equation of motion allowing the minimization of system energy with respect to a discrete state and control trajectory. The work ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2022
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym14081724